package ACM.red;

/**
 * @Author wwk
 * @DATE 2022/8/28 16:33
 */
import java.util.*;

public class second {
//1 ≤ n ≤30000, 1 ≤ K ≤ 1016, 1 ≤ ai ≤109。
static List<ArrayList<Integer>> res = new ArrayList<>();
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();  //法术数量
        long k = scanner.nextLong();  //威力值需求
        int[] magic = new int[n];  //法术威力列表
        for (int i = 0; i < magic.length; i++) {
            magic[i] = scanner.nextInt();
        }

        // //从n个法术中找到两个，和>=k的结果数量
        // dfs(k,magic,new ArrayList<>(),1L, new boolean[n]);
        // System.out.println(res.size());

        Arrays.sort(magic);
        int privot = 0;
        for (int i = 0; i < n; i++) {
            //遍历每一个元素，找到与之相乘超过目标k的最大值
            long help = (long)Math.ceil(k*1.0/magic[i]);
            int idx = helper(magic,0,magic.length-1,help);
            //看是否合法
            if(idx< magic.length && magic[idx]<help){
                idx++;
            }
            privot = n - idx;
            if(i>=idx){
                privot--;
            }
        }
        System.out.println(privot);
    }

    //二分法找到大于 k/magic的值
    static int helper(int[] magic, int left, int right, long help){
        while(left<right){
            int mid = left+(right-left)/2;
            if(help<=magic[mid]){
                right = mid;
            }else{
                left = mid-1;
            }
        }
        return left;
    }

    //回溯会超时只过82%
    static void dfs(long k, int[] magic, ArrayList<Integer> path, long sum, boolean[] used){
        if(path.size()==2){
            if(sum >= k ){
                res.add(new ArrayList<>(path));
            }
            return;
        }

        for(int i=0;i<magic.length;i++){
            if(used[i]){
                continue;
            }
            path.add(magic[i]);
            sum*=magic[i];
            used[i] = true;
            dfs(k,magic,path,sum,used);
            path.remove(path.size()-1);
            sum/=magic[i];
            used[i] = false;
        }
    }
}
